Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
نویسندگان
چکیده
منابع مشابه
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
The edge-integrity of a graph G is I 0(G) := minfjSj + m(G S) : S Eg; where m(H) denotes the maximum order of a component of H: A graph G is called honest if its edge-integrity is the maximum possible, that is, equals the order of the graph. The only honest 2-regular graphs are the 3-, 4-, and 5-cycles. Lipman [13] proved that there are exactly twenty honest cubic graphs. In this paper we explo...
متن کاملA Note on Edge Isoperimetric Numbers and Regular Graphs
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this result to a few other sequences.
متن کاملLower Bounds for the Isoperimetric Numbers of Random Regular Graphs
The vertex isoperimetric number of a graph G = (V ,E) is the minimum of the ratio |∂V U |/|U | where U ranges over all nonempty subsets of V with |U |/|V | ≤ u and ∂V U is the set of all vertices adjacent to U but not in U . The analogously defined edge isoperimetric number—with ∂V U replaced by ∂EU , the set of all edges with exactly one endpoint in U —has been studied extensively. Here we stu...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1999
ISSN: 0195-6698
DOI: 10.1006/eujc.1998.0295